Differential Phase Estimation with the SeaMARC II Bathymetric Sidescan Sonar System

A maximum-likelihood estimator is used to extract differential phase measurements from noisy seafloor echoes received at pairs of transducers mounted on either side of the SeaMARC II bathymetricsidescan sonar system. Carrier frequencies for each side are about 1 kHz apart, and echoes from a transmitted pulse 2 ms long are analyzed. For each side, phase difference sequences are derived from the full complex data consisting of base-banded and digitized quadrature components of the received echoes. With less bias and a lower variance, this method is shown to be more efficient than a uniform mean estimator. It also does not exhibit the angular or time ambiguities commonly found in the histogram method used in the SeaMARC II system. A figure for the estimation uncertainty of the phasedifference is presented, and results are obtained for both real and simulated data. Based on this error estimate and an empirical verification derived through coherent ping stacking, a single filter length of 100 ms is chosen for data processing application

CSNL: A cost-sensitive non-linear decision tree algorithm

This article presents a new decision tree learning algorithm called CSNL that induces Cost-Sensitive Non-Linear decision trees. The algorithm is based on the hypothesis that nonlinear decision nodes provide a better basis than axis-parallel decision nodes and utilizes discriminant analysis to construct nonlinear decision trees that take account of costs of misclassification. The performance of the algorithm is evaluated by applying it to seventeen datasets and the results are compared with those obtained by two well known cost-sensitive algorithms, ICET and MetaCost, which generate multiple trees to obtain some of the best results to date. The results show that CSNL performs at least as well, if not better than these algorithms, in more than twelve of the datasets and is considerably faster. The use of bagging with CSNL further enhances its performance showing the significant benefits of using nonlinear decision nodes. The performance of the algorithm is evaluated by applying it to seventeen data sets and the results are compared with those obtained by two well known cost-sensitive algorithms, ICET and MetaCost, which generate multiple trees to obtain some of the best results to date. The results show that CSNL performs at least as well, if not better than these algorithms, in more than twelve of the data sets and is considerably faster. The use of bagging with CSNL further enhances its performance showing the significant benefits of using non-linear decision nodes

A Fast O(n) Algorithm For Adaptive Filter Bank Design

Designing optimal filer banks for subband coding applications has recently attracted considerable attention [1]-[5]. In particular, the authors have developed an adaptive algorithm based on stochastic gradient descent (SGD) that enables one to optimize two channel paraunitary filter banks in an on-line fashion [3]. The idea has also been extended to the case of tree-structured filter banks [4]. The computational complexity of the algorithm proposed in [3] is proportional to N 2 where N is the number of stages in the paraunitary lattice. In this paper we derive a fast algorithm which reduces the amount of computation to O(N). We also show that the new algorithm can be implemented using an IIR lattice. Some issues regarding numerical stability of the IIR implementation are also discussed. 1. INTRODUCTION A two channel paraunitary filter bank can be implemented using QMF lattices that insure perfect reconstruction irrespective of the specific choice of lattice coefficients [7]. For su..